A Tabu Search Approach for Milk Collection in Western Norway Using Trucks and Trailers

نویسندگان

  • Arild Hoff
  • Arne Løkketangen
چکیده

Milk collection is a problem which is well known in rural areas all around the world. This paper considers a real world problem for a Norwegian dairy company collecting raw milk from farmers. Chao (2002) and Scheuerer (2006) describe the Truck and Trailer Routing Problem (TTRP) as a variant of the traditional Vehicle Routing Problem (VRP). In this problem customers are divided into vehicle customers who can be reached with a complete vehicle with a trailer, and truck customers who only can be reached by a single truck. Most Norwegian farms are however small and inaccessible for a large truck with a trailer, and thus our problem can be classified as a special type of the TTRP where all customers are defined as truck-customers. The company uses a fleet of heterogeneous trucks with tanks for the milk, and a truck can either drive the route by itself or carry a trailer with an additional tank. The routes are then designed in a way that allows the trailer to be parked at a parking place while the truck is visiting the farms and collecting the milk. The possible parking places are prearranged mostly at large parking lots or petrol stations. When the tank on the truck is full, the truck will return to the parked trailer. It can then fill the milk over from the truck tank to the trailer tank and start on a new subtour from the same spot, or it can drive the trailer to a new parking place, fill the milk over and start a subtour from there. Figure 1 shows a graph which represents a solution to the milk collection problem with the constraints mentioned. The circle marks the depot, while the squares are the parking places which are used as roots for the subtours that visits the suppliers marked with triangles. This type of solutions, with the trailer serving as a mobile depot for the truck, was first described by Vahrenkamp (1989) for the milk collection in Western Germany.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tabu-KM: A Hybrid Clustering Algorithm Based on Tabu Search Approach

  The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...

متن کامل

A heuristic approach for multi-stage sequence-dependent group scheduling problems

We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...

متن کامل

A Tabu Search Method for a New Bi-Objective Open Shop Scheduling Problem by a Fuzzy Multi-Objective Decision Making Approach (RESEARCH NOTE)

This paper proposes a novel, bi-objective mixed-integer mathematical programming for an open shop scheduling problem (OSSP) that minimizes the mean tardiness and the mean completion time. To obtain the efficient (Pareto-optimal) solutions, a fuzzy multi-objective decision making (fuzzy MODM) approach is applied. By the use of this approach, the related auxiliary single objective formulation can...

متن کامل

A matheuristic for the truck and trailer routing problem

3 COPA, Department of Industrial Engineering, Universidad de los Andes, Bogota, Colombia {amedagli, nvelasco}@uniandes.edu.co In the truck and trailer problem (TTRP), raised for instance by milk collection in rural areas, a heterogeneous fleet composed of mt trucks and mr trailers (mr < mt) serves a set of customers N = {1, 2, ..., n} from a main depot, denoted as node 0. Each customer i ∈N h...

متن کامل

An Integer Programming Model and a Tabu Search Algorithm to Generate α-labeling of Special Classes of Quadratic Graphs

First, an integer programming model is proposed to find an &alpha;-labeling for quadratic graphs. Then, a Tabu search algorithm is developed to solve large scale problems. The proposed approach can generate &alpha;-labeling for special classes of quadratic graphs, not previously reported in the literature. Then, the main theorem of the paper is presented. We show how a problem in graph theory c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007